• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    The present application discloses a reliable protocol-based data processing method and equipment. The method includes the following: determining the transfer rates for service data with different processing priorities, and when the service data is stored in a block, getting the service data with different processing priorities, so that the service data service with different processing priorities can be processed, an existing technology rule of processing data of a service based solely on time can be broken, and an existing technology issue of low processing efficiency of a service with a relatively low service priority high can be alleviated. The solution provided in the embodiments of the present invention not only ensures efficient processing of service data with a high processing priority, but also ensures efficient processing of service data with low processing priority. When a processing priority is satisfied, the flexibility of processing service data in a trust protocol is increased and the usage value of the trust protocol in the service application field is also improved.(...).
    公开号:BR112019013412B1
    申请号:R112019013412-3
    申请日:2018-03-26
    公开日:2022-02-01
    发明作者:Honglin Qiu
    申请人:Advanced New Technologies Co., Ltd；
    IPC主号:
    专利说明:

    FIELD OF THE INVENTION
    [001] The present application concerns the field of Internet information processing technologies and the field of computer technologies and, in particular, a method and equipment of data processing based on a trusted protocol (blockchain). BACKGROUND OF THE INVENTION
    [002] Trust protocol technology is also known as distributed ledger technology. As a distributed Internet database technology, trust protocol technology is characterized by decentralization, transparency, non-tampering, and reliability. A network built on trust protocol technology can be called a trust protocol network. The trust protocol network includes network nodes (which may also be referred to as a trust protocol node, and is simply referred to as a node below). Each network node corresponds to at least one trust protocol and each trust protocol includes at least one block.
    [003] Upon receiving data to be stored, the network node transmits the data to be stored on other network nodes in the trusted protocol network. Therefore, each network node in the trust protocol network stores complete trust protocol network data, and the data stored on one network node is consistent with that stored on another node.
    [004] Data is generally stored in the trust protocol network in two stages: In a first stage, a node in the trust protocol network receives data to be stored and transmits the data throughout the trust protocol network. As such, each node in the trusted protocol network receives the data to be stored. In this case, each network node in the trust protocol network writes the data to be stored in a cache. In a second stage, a network node in the trust protocol network that obtains permission to store the data to be stored writes the data to be stored to a block upon obtaining write permission and adds the block to an existing trust protocol. It can be seen that the data is stored in the trusted protocol network using an asynchronous write policy.
    [005] However, in a real service scenario, when service data is stored on a trusted protocol network using an asynchronous write policy, generally, a queue of a group of data is maintained at a first stage and the data to be stored is written sequentially to the data group queue based on a timestamp of the data to be stored. As such, in a second stage, the data to be stored in the data group queue is written to a block based on a “first in first out” principle.
    [006] According to certain research, in the previous method, there are the following problems in storing data in the trusted protocol network. For services with relatively high service priorities, the service data processing efficiency is relatively low, and consequently, the processing efficiency of these services is relatively low. DESCRIPTION OF THE INVENTION
    [007] In view of the above, embodiments of the present invention provide a reliable protocol-based data processing method and equipment to alleviate a problem of existing technology of low efficiency of service data processing with a relatively high service priority.
    [008] An embodiment of the present invention provides a method of processing data based on a trusted protocol, including the following: receiving, by a node in a trusted protocol network, at least one piece of service data generated in a specified period of time, where the service data includes label information used to represent a processing priority of the service data; determining, by the node when a new block is generated, a throughput that matches the label information based on a predetermined mapping relationship between the label information and a throughput; obtain, by the node, service data that satisfies the throughput and that includes the label information from a throughput-based data processing set, where the received service data is stored in the data processing set ; and storing the obtained service data in the block.
    [009] An embodiment of the present application further provides a reliable protocol-based data processing device, including the following: a receiving unit, configured to receive at least one fragment of service data generated in a period of specified time, where the service data includes label information used to represent a processing priority of the service data; a determination unit configured to determine, when a new block is generated, a baud rate that corresponds to the label information based on a predetermined mapping relationship between the label information and a baud rate; an acquisition unit, configured to obtain service data that satisfies the throughput and that includes the label information from a data processing set based on the throughput, where the service data received is stored in the set of data. Data processing; and a processing unit, configured to store the service data obtained in the block.
    [0010] At least one of the previously described technical solutions used in the embodiments of the present invention can achieve the following beneficial effects:
    [0011] Transfer rates are determined for service data with different processing priorities and when service data is stored in a block, service data with different processing priorities is obtained, so that service data with different processing priorities can be processed, an existing service data processing technology rule based solely on time can be broken, and an existing technology problem of low processing efficiency of a service with a relatively high service priority can be broken. be relieved. The solution provided in the embodiments of the present invention not only ensures the processing efficiency of the service data with a high processing priority, but also ensures the processing efficiency of the service data with a low processing priority. When a processing priority is satisfied, the flexibility of processing service data in a trusted protocol is increased and the usage value of the trusted protocol in the service application field is also improved. BRIEF DESCRIPTION OF THE DRAWINGS
    [0012] The accompanying drawings described herein are intended to provide a further understanding of the present invention and constitute a part of the present invention. Illustrative embodiments of the present invention and descriptions thereof are intended to describe the present application and do not constitute limitations on the present application. In the attached drawings:
    [0013] Figure 1 is a schematic flowchart illustrating a reliable protocol-based data processing method, according to an embodiment of the present invention;
    [0014] Figure 2 is a schematic diagram illustrating a processing data set corresponding to service data with different processing priorities, in accordance with an embodiment of the present invention;
    [0015] Figure 3 is a diagram illustrating a scenario of a trusted protocol-based data processing method, according to an embodiment of the present invention; and
    [0016] Figure 4 is a schematic structural diagram illustrating a trusted protocol-based data processing device, according to an embodiment of the present invention. DESCRIPTION OF EMBODIMENTS OF THE INVENTION
    [0017] In order to clarify the objectives, technical solutions and advantages of the present invention, the technical solutions of the present invention are clearly and comprehensively described with reference to specific embodiments and accompanying drawings of the present invention. Apparently, the described embodiments are just some and not all embodiments of the present invention. All other embodiments obtained by a person skilled in the art based on the embodiments of the present invention without creative efforts should fall within the scope of protection of the present invention.
    [0018] The technical solutions provided in the embodiments of the present invention are described in detail below with reference to the accompanying drawings.
    [0019] Figure 1 is a schematic flowchart illustrating a reliable protocol-based data processing method, according to an embodiment of the present invention. The method can be described as follows. The execution body in this embodiment of the present invention can be any service node (which may also be referred to as a trusted protocol node, and is simply referred to as a node below) in a trusted protocol network, not is limited here. In this embodiment of the present invention, an example that the execution body is a node is used for description in detail.
    [0020] Step (101): A node in the trusted protocol network receives at least a portion of the service data generated in a specified period of time.
    [0021] Service data includes label information used to represent a processing priority of service data.
    [0022] In this embodiment of the present invention, a processing priority can be set for service data generated for different services, and label information indicating that a service data processing priority is added to the service data when the service data of services are generated. Thus, when the service data is received, the processing priority of the service data can be determined based on the label information. Processing priority here can also be referred to as a processing level. Embodiments are not limited here.
    [0023] Furthermore, in this embodiment of the present invention, the processing priority set for the service data can be determined based on a service type or can be determined based on other factors. Embodiments are not limited here. For example, processing priorities for different service data generated for the same service may be the same or different. Priority processing of different service data generated for different services may be the same or may be different.
    [0024] For example, first, service priorities can be determined for different services. Here, a service priority corresponds to a service data processing priority, that is, a higher service priority indicates a higher service processing priority of the generated service data for the service. Then a field can be added to the service data. So the field can be called label information and is used to represent a processing priority of the service data.
    [0025] Preferably, in the technical solution provided in this embodiment of the present invention, the throughput can be determined in advance for service data with different processing priorities, and a mapping relationship between label information that corresponds to a priority processing time and a certain transfer rate is established.
    [0026] The service data processing priorities of different services are determined and the mapping relationships between different processing priorities and label information are determined. The transfer rates that correspond to processing priorities are determined based on processing priorities. Mapping relationships between label information that correspond to processing priorities and throughput are established.
    [0027] It's worth noting that the throughput here can be a processing fee or it can be a processing amount. Embodiments are not limited here.
    [0028] Table 1 is a table of a mapping relationship between label information and a throughput. Table 1

    [0029] It can be seen from Table 1 that if the label information included in the service data is 10,000, it indicates that the processing priority of the service data is the first priority and the throughput of the processing priority is 30%. If the label information included in the service data is 20,000, it indicates that the processing priority of the service data is the second priority, and the throughput for the processing priority is 20%. If the label information included in the service data is 30,000, it indicates that the processing priority of the service data is the third priority and the throughput for the processing priority is 10%. It is worth noting that the throughput shown in Table 1 uses a one-block storage capacity in a trusted protocol as a unit. Therefore, an amount of service data for a specific service that needs to be stored in the block can be obtained through calculations based on the throughput and storage capacity of the block.
    [0030] In one embodiment of the present invention, the transfer rates of the same service data may be different in different time periods. That is, a plurality of processing priorities can be set for the same service data type. As such, service data transfer rates are different in different time periods.
    [0031] Here, service data A is used as an example for description. In this embodiment of the present invention, service data A is assumed to belong to service data whose processing priority is first priority. In this case, it can be specified that a data transfer rate of service A at any given time can occupy 30% of the block's storage capacity. In addition, the data transfer rate of service A can be dynamically adjusted.
    [0032] For example, in time period T1, it is specified that service data A belongs to service data whose processing priority is second priority, and a data transfer rate of service A can occupy 30% of the capacity block storage. In the time period T2, it is specified that service A data belongs to service data whose processing priority is the first priority, and a data transfer rate of service A can occupy 50% of the storage capacity of the block. In the time period T3, it is specified that service A data belongs to service data whose processing priority is the third priority, and a data transfer rate of service A can occupy 10% of the block's storage capacity. As such, in this embodiment of the present invention, a correspondence can be established in advance between a time period, label information and a throughput. For example, when service data is generated, a time period that corresponds to the service data generation time is determined and label information that corresponds to the time period is included in the service data.
    [0033] Generally, fields in service data include, but are not limited to, a hash value, a version number, a public key, a signature, a hash value of a block to which the service data belongs, a timestamp (i.e. a time when the node processes the service data), etc. In this case, the fields included in the service data described in this embodiment of the present invention include, but are not limited to, those shown in Table 2. The specific attributes of the fields are described in Table 2. Table 2

    [0034] Preferably, in this embodiment of the present invention, the processing data sets may be further configured to service data with different processing priorities based on certain processing priorities. As such, upon receiving the service data, the service data can be stored separately based on the label information included in the service data. That is, service data that includes the same label information is stored in the same data processing set.
    [0035] It is worth noting that because there is a time gap between two adjacent blocks in a trust protocol, this time gap can be used as a reference condition to define a time period in this embodiment of the present invention. . Embodiments are not limited here.
    [0036] Preferably, in this embodiment of the present invention, when the node receives at least a portion of the service data generated in the specified time period, the method further includes the following: determining the data processing set that corresponds to label information based on label information included in the service data; and storing the service data in the given data processing set.
    [0037] Figure 2 is a schematic diagram illustrating a processing data set corresponding to service data with different processing priorities, in accordance with an embodiment of the present invention. It can be seen from Figure 2 that two sets of data processing are included. A processing data set corresponds to processing priority 1, that is, service data corresponding to processing priority 1 is stored in the processing data set. The other data processing set corresponds to processing priority 2, that is, service data corresponding to processing priority 2 is stored in the processing data set.
    [0038] Step (102): When a new block is generated, the node determines a throughput that matches the label information based on a predetermined mapping relationship between the label information and a throughput.
    [0039] In this embodiment of the present invention, the predetermined mapping relationship between label information and a throughput can be established in the following method: determining service data processing priorities of different services and determining mapping relationships between different services. processing priorities and label information; determine transfer rates that correspond to processing priorities based on processing priorities; and establishing mapping relationships between label information that correspond to processing priorities and throughput.
    [0040] A portion of the label information is randomly selected, and a throughput that corresponds to the label information is determined and selected based on the predetermined mapping relationship between the label information and a throughput.
    [0041] Here, label information can be selected based on the order of processing priorities and can be sequentially determined in descending order of processing priorities. Also, the transfer rates that correspond to different label information are determined in the previous method.
    [0042] Step (103): The node obtains service data that satisfies the throughput and that includes the label information from a data processing set based on the throughput.
    [0043] In this embodiment of the present invention, an amount of service data that includes the label information is determined based on the throughput and storage capacity of the block.
    [0044] The quantity service data that includes the label information is obtained from the data processing set, where the received service data is stored in the data processing set.
    [0045] For example, for service data to be processed, the throughput that corresponds to the label information can be determined based on the predetermined mapping relationship between label information and throughput, for example, the throughput transfer is p (as a percentage). In this case, in this embodiment of the present invention, a storage capacity of a new generated block is determined. For example, if the storage capacity is x, it is determined that an amount of service data that corresponds to the label information that needs to be stored in the block is xp.
    [0046] Preferably, when the new block is generated, if the received service data matches at least two different processing priorities, the node determines the transfer rates that correspond to the label information of different processing priorities, where a sum of baud rates that correspond to different label information is less than or equal to a block's storage capacity.
    [0047] For example, suppose the service data to be processed matches a plurality of processing priorities (eg processing priority 1 and processing priority 2). In this case, the throughput that corresponds to the label information is determined separately based on the predetermined mapping relationship between the label information and a throughput. For example, the throughput that corresponds to the processing priority 1 label information is p (as a percentage) and the throughput that corresponds to the processing priority 2 label information is m (as a percentage).
    [0048] In another example, suppose the service data to be processed corresponds to a plurality of services (e.g. service 1 and service 2, where the processing priority that corresponds to service 1 is processing priority 1 and priority that corresponds to service 2 is processing priority 2). In this case, the throughput that corresponds to the label information is determined separately based on the predetermined mapping relationship between the label information and a throughput. For example, the throughput that corresponds to the label information of service 1 is p (as a percentage) and the throughput that corresponds to the label information of service 2 is m (as a percentage).
    [0049] In this embodiment of the present invention, a storage capacity of a new generated block is determined. For example, if the storage capacity is x, it is determined that an amount of service data that corresponds to the processing priority 1 label information that needs to be stored in the block is xp and an amount of service data that corresponds to the information of processing priority 2 label that need to be stored in the block are xm. It is worth noting here that a sum of xm and xp is less than or equal to x.
    [0050] In another case, some service data has relatively low processing priorities, and the system does not set label information for the service data or set label information for the service data, but does not determine a throughput for the service data. the service data. For this case, a processing method can be, but is not limited to, the following method: when the service data does not include label information, obtain, based on an idle capacity of the block, service data that satisfies the idle capacity and do not include data processing set label information; or when a throughput that matches the label information is zero, obtain, based on an idle capacity of the block, service data that satisfies the idle capacity and includes the label information from the data processing set.
    [0051] For example, the service data received corresponds to a plurality of services (e.g., service 1, service 2 and service 3) or a plurality of processing priorities. In this case, the throughput that corresponds to the label information is determined separately based on the predetermined mapping relationship between the label information and a throughput. For example, the throughput that corresponds to the label information of service 1 is p (as a percentage), the throughput that corresponds to the label information of service 2 is m (as a percentage), and the throughput that matches service label information 3 is null.
    [0052] In this embodiment of the present invention, a storage capacity of a new generated block is determined. For example, if the storage capacity is x, it is determined that an amount of service data that corresponds to the label information of service 1 that needs to be stored in the block is xp, an amount of service data that corresponds to the label information of service 2 that needs to be stored in the block is xm, and an amount of service data that corresponds to the label information of service 3 that needs to be stored in the block is (1 - p - m) x x.
    [0053] There is yet another case in this embodiment of the present invention, namely, an amount of service data stored in the data processing set that corresponds to the label information is less than the throughput, which means that the service data stored in the data processing set cannot satisfy the throughput requirement. To implement proper resource usage, in this case, service data is obtained from the data processing set based on the amount of service data stored in the data processing set. That is, all service data stored in the data processing set is read.
    [0054] In this embodiment of the present invention, the service data satisfying the transfer rates is obtained based on the transfer rate and timestamp of the service data of the data processing set that corresponds to the information of label.
    [0055] The service data satisfying the throughput is obtained from the processing data set that matches the label information based on the order of a corresponding processing time of the service data.
    [0056] Step (104): The node stores the service data obtained in the block.
    [0057] In this embodiment of the present invention, the obtained service data is stored sequentially in the block based on the corresponding processing time order of the service data.
    [0058] According to the technical solution provided in this embodiment, transfer rates are determined for service data with different processing priorities, and when service data is stored in a block, service data with different processing priorities processing priorities are obtained, so that service data with the different processing priorities can be processed, a rule of existing technology of processing service data based only on time can be broken and an issue of existing technology of low efficiency of processing a service with a relatively high service priority can be alleviated. The solution provided in the embodiments of the present invention not only ensures the processing efficiency of the service data with a high processing priority, but also ensures the processing efficiency of the service data with a low processing priority. When a processing priority is satisfied, the flexibility of processing service data in a trusted protocol is increased and the value of using the trusted protocol in the service application field is also improved.
    [0059] Figure 3 is a diagram illustrating a scenario of a reliable protocol-based data processing method, according to an embodiment of the present invention. It can be seen from Figure 3 that upon receiving service data, a node in a trusted protocol network determines the label information from the service data. When a new block is generated, a processing amount of service data can be determined based on a service processing priority of the service data, and the service data satisfying the processing amount is obtained from a cache. and stored in the block (which is implemented in the path of steps (102) and (103) of the previous embodiment).
    [0060] Figure 4 is a schematic structural diagram illustrating a trusted protocol-based data processing device, according to an embodiment of the present invention. The data processing device includes a receiving unit (401), a determining unit (402), an acquisition unit (403) and a processing unit (404).
    [0061] The receiving unit (401) is configured to receive at least one piece of service data generated in a specified period of time, where the service data includes label information used to represent a processing priority of the service data. service.
    [0062] The determination unit (402) is configured to determine, when a new block is generated, a baud rate that corresponds to the label information based on a predetermined mapping relationship between label information and a baud rate.
    [0063] The acquisition unit (403) is configured to obtain service data that satisfies the throughput and that includes the label information from a data processing set based on the throughput, where the service data received are stored in the data processing set.
    [0064] The processing unit (404) is configured to store the service data obtained in the block.
    [0065] In another embodiment of the present invention, the data processing device further includes an establishment unit (405).
    [0066] The establishment unit (405) establishes the predetermined mapping relationship between label information and a throughput, including the following: determining service data processing priorities of different services and determining mapping relationships between different priorities processing and label information; determine transfer rates that correspond to processing priorities based on processing priorities; and establishing mapping relationships between label information that correspond to processing priorities and throughput.
    [0067] In another embodiment of the present invention, the transfer rate of the same service data is different in different time periods.
    [0068] In another embodiment of the present invention, the acquisition unit (403) obtains service data that satisfies the throughput and that includes the label information from a data processing set based on the throughput, including the following: determine an amount of service data that includes label information based on throughput and a block storage capacity; and getting the quantity service data that includes the label information from the data processing set.
    [0069] In another embodiment of the present invention, the acquisition unit (403) obtains service data that satisfies the throughput and that includes the label information from a data processing set based on the throughput , including the following: when the service data does not include label information, obtain, based on an idle capacity of the block, service data that satisfies the idle capacity and does not include label information from the data processing set; or when a throughput that matches the label information is zero, obtain, based on an idle capacity of the block, service data that satisfies the idle capacity and includes the label information from the data processing set.
    [0070] In another embodiment of the present invention, the data processing device further includes a storage unit (406).
    [0071] When the node receives at least a portion of the service data generated in the specified time period, the storage unit (406) determines the data processing set that corresponds to the label information based on the label information included in the service data; and stores the service data in the given data processing set.
    [0072] In another embodiment of the present invention, the acquisition unit (403) obtains service data that satisfies the throughput and that includes the label information from a data processing set based on the throughput , including the following: get service data that satisfies throughput based on throughput and a timestamp of service data from the data processing set that matches the label information.
    [0073] In another embodiment of the present invention, the acquisition unit (403) obtains service data that satisfies the throughput and that includes the label information from a data processing set based on the throughput , including the following: when an amount of service data stored in the processing data set that corresponds to the label information is less than the throughput, get the service data from the processing data set based on the amount of service data stored in the data processing set.
    [0074] In another embodiment of the present invention, the determination unit (402) determines, when a new block is generated, a baud rate that corresponds to the label information based on a predetermined mapping relationship between label information and a throughput, including the following: when the new block is generated, if the service data received matches at least two different processing priorities, determine the throughputs that correspond to label information of different processing priorities, where a sum of baud rates that correspond to different label information is less than or equal to a block storage capacity.
    [0075] It is worth noting that, the data processing device provided in this embodiment of the present invention can be implemented using software or hardware. Embodiments are not limited here. The data processing device described in this embodiment of the present invention determines the transfer rates for service data with different processing priorities, and when the service data is stored in a block, obtains the service data with the different priorities. processing, so that service data with different processing priorities can be processed, an existing technology rule of data processing service based solely on time can be broken, and an existing technology issue of low processing efficiency of a service with a relatively high service priority can be alleviated. The solution provided in the embodiments of the present invention not only ensures the processing efficiency of the service data with a high processing priority, but also ensures the processing efficiency of the service data with a low processing priority. When a processing priority is satisfied, the flexibility of processing service data in a trusted protocol is increased and the usage value of the trusted protocol in the service application field is also improved.
    [0076] In the 1990s, whether a technical improvement is a hardware improvement (for example, an improvement to a circuit structure such as a diode, a transistor, or a switch) or a software improvement (an improvement to a of method) can be clearly distinguished. However, as technologies develop, current improvements in many method procedures can be considered as direct improvements in hardware circuit structures. A designer often programs an improved method procedure into a hardware circuit to obtain a corresponding hardware circuit structure. Therefore, a method procedure can be enhanced using a hardware entity module. For example, a programmable logic device (PLD) (eg a Field Programmable Gate Array (FPGA)) is an integrated circuit and a logic function of the PLD is determined by a user by programming the device. The designer performs programming to “integrate” a digital system into a single PLD, without requiring a chip manufacturer to design and produce an application-specific integrated circuit chip. Also, at the moment, rather than manually fabricating an integrated circuit chip, such programming is mostly implemented using “logic compiler” software. Logic compiler software is similar to a software compiler used to develop and write the program. The original code must be written in a specific programming language for compilation. The language is referred to as a hardware description language (HDL). There are many HDLs, such as Advanced Boolean Expression Language (ABEL), Altera Hardware Description Language (AHDL), Confluence, Cornell University Programming Language (CUPL), HDCal, Java Hardware Description Language (JHDL), Lava, Lola, MyHDL, PALASM and Ruby Hardware Description Language (RHDL), etc. The High Speed Integrated Circuit (VHDL) and Verilog Hardware Description Languages are most commonly used. One skilled in the art should also understand that a hardware circuit that implements a logic method procedure can be easily obtained once the method procedure is logically programmed using the various hardware description languages described and is programmed into an integrated circuit.
    [0077] A controller can be implemented using any appropriate method. For example, the controller may be a microprocessor or a processor, or a computer-readable medium, which stores computer-readable program code (such as software or firmware) that can be executed by the microprocessor or processor, a logic gate, a switch , an application-specific integrated circuit (ASIC), a programmable logic controller, or an embedded microprocessor. Examples of the controller include, but are not limited to, the following microprocessors: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicon Labs C8051F320. The memory controller can also be implemented as part of the memory control logic. One skilled in the art also knows that in addition to implementing the controller using computer-readable program code, logic programming can be performed in the method steps to allow the controller to implement the same functions in forms of the logic gate, switch, application-specific integrated circuit, from the programmable logic controller, an embedded microcontroller. Therefore, the controller can be thought of as a hardware component, and a device configured to implement various functions in the controller can also be thought of as a structure in the hardware component. Or the device configured to implement various functions can still be considered as a software module, implementing the method and a structure in the hardware component.
    [0078] The system, device, module or unit illustrated in the previous embodiments may be implemented using a computer chip or entity, or may be implemented using a product having a certain function. A typical embodiment device is a computer. The computer can be, for example, a personal computer, a portable computer, a cell phone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an e-mail device, a game console, a tablet computer, or a wearable device, or a combination of any of these devices.
    [0079] For ease of description, the above device is described by dividing functions into several units. Of course, when the present invention is implemented, a function of each unit may be implemented in one or more pieces of software and/or hardware.
    [0080] One skilled in the art should understand that an embodiment of the present invention may be provided as a method, a system or a computer program product. Therefore, the present invention may utilize a hardware-only embodiment, a software-only embodiment, or a combination of software and hardware embodiments. In addition, the present invention may use a form of computer program product that is implemented on one or more computer-usable storage media (including, but not limited to, disk memory, CD-ROM, and optical memory, etc.) that include computer usable program code.
    [0081] The present description is described with reference to flowcharts and/or block diagrams of the method, device (system) and computer program product based on embodiments of the present invention. It is worth noting that computer program instructions can be used to implement each process and/or each block in flowcharts and/or block diagrams and a combination of a process and/or a block in flowcharts and/or diagrams. blocks. These computer program instructions may be provided to a general purpose computer, a dedicated computer, an embedded processor, or a processor of another programmable data processing device to generate a machine such that the instructions executed by the computer or processor from any other programmable data processing device generates an apparatus for implementing a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.
    [0082] These computer program instructions can be stored in a computer-readable memory that can instruct the computer or other programmable data processing device to work in a specific way, such that the instructions stored in the computer-readable memory generate an artifact that includes an instructional apparatus. The instructional apparatus implements a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.
    [0083] These computer program instructions can be loaded onto the computer or other programmable data processing devices, so that a series of operations and steps are performed on the computer or other programmable devices, thereby generating computer-implemented processing. Therefore, instructions executed on the computer or other programmable devices provide steps to implement a specific function in one or more processes in flowcharts and/or in one or more blocks in block diagrams.
    [0084] In one embodiment, a computing device includes one or more processors (CPU), one or more input/output interfaces, one or more network interfaces, and one or more memories.
    [0085] Memory may include non-persistent memory, random access memory (RAM), non-volatile memory, and/or other form that is on a computer-readable medium, for example, read-only memory (ROM) or flash memory (flash RAM memory). Memory is an example of a computer-readable medium.
    [0086] Computer readable media include persistent, non-persistent, mobile and immobile media that can store information using any method or technology. The information can be a computer-readable instruction, a data structure, a program module, or other data. Examples of a computer storage medium include, but are not limited to, phase-shift memory (PRAM), a static random access memory (SRAM), a dynamic random access memory (DRAM), another type of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disk read-only memory (CD-ROM), a digital versatile disc (DVD) or other optical storage devices, a magnetic tape cassette, magnetic tape/magnetic disk storage, other magnetic storage devices. The computer storage medium can be used to store information accessible by the computing device. Based on the definition of this specification, the computer-readable medium does not include a transient computer-readable medium (transient medium), such as a modulated and carrier data signal.
    [0087] It is also worth noting that the terms “include”, “contain” or any other variants are intended to cover a non-exclusive inclusion, so that a process, a method, a product or a device that includes a list of Elements not only includes those elements, but also includes other elements that are not expressly listed, or even include elements inherent in such a process, method, product or device. Without further restrictions, an element preceded by "includes a..." does not preclude the existence of additional identical elements in the process, method, product or device that includes the element.
    [0088] The present invention can be described in the general context of computer-executable instructions executed by a computer, for example, a program module. Generally speaking, the program module includes a routine, a program, an object, a component, a data structure, etc. performing a specific task or implementing a specific abstract data type. The present invention may also be practiced in distributed computing environments. In distributed computing environments, tasks are performed by remote processing devices connected through a communications network. In a distributed computing environment, the program module can be located on both local and remote computer storage media, including storage devices.
    [0089] The embodiments in the present specification are all described in a progressive manner. For the same or similar parts of the embodiments, references may be made to the embodiments. Each embodiment focuses on a difference from other embodiments. Particularly, a system embodiment is basically similar to a method embodiment and is therefore described briefly. For related parties, references may be made to related descriptions of the method embodiment.
    [0090] The foregoing embodiments are embodiments of the present invention and are not intended to limit the present invention. One skilled in the art can make various modifications and changes to the present invention. Any modification, equivalent replacement, or improvement made without departing from the scope of the present invention shall be within the scope of the claims of the present invention.
    权利要求:
    Claims (20)
    [0001]
    1. METHOD FOR PROCESSING DATA BASED ON A TRUST PROTOCOL, characterized by: receiving (101), by a node in a trusted protocol network, service data generated in a specified period of time, in which the data service data portions comprise a plurality of service data portions, wherein each or more of the plurality of service data portions is associated with a respective label used to represent a processing priority of the service data portion; determining (102), by the node when a new block is generated, respective baud rates for processing data associated with the different labels based on a predetermined mapping relationship between the respective labels and the respective baud rates; obtaining (103), by the node and from the service data, one or more selected portions of service data in accordance with the respective transfer rates; and storing (104) the one or more selected portions of service data in the new block.
    [0002]
    2. METHOD, according to claim 1, characterized in that it additionally comprises: determining service data processing priorities of different services; determine mapping relationships between different processing priorities and the respective labels; determining (102) the respective transfer rates based on different processing priorities; and establishing mapping relationships between respective labels that correspond to different processing priorities and respective transfer rates.
    [0003]
    3. METHOD, according to claim 2, characterized in that the transfer rates of the same service data are different in different periods of time.
    [0004]
    4. METHOD according to claim 1, characterized by obtaining (103), by the node and from the service data, one or more selected portions of service data according to the respective transfer rates comprising, for each respective label: determining an amount of service data portions associated with the respective label based on the respective throughput and a storage capacity of the block; and obtaining the amount of service data portions associated with the respective label.
    [0005]
    5. METHOD, according to claim 1, characterized by obtaining (103), by the node and from the service data, one or more selected portions of service data according to the respective transfer rates, comprising, for each respective label: in response to determining that the service data is not associated with the respective label, obtain, based on an idle capacity of the new block, service data that satisfies the idle capacity and which is not associated with the respective label ; or in response to determining (102) that the respective throughput corresponding to the label is zero, obtaining, based on the idle capacity of the block, service data that satisfies the idle capacity and is associated with the respective label.
    [0006]
    6. METHOD, according to claim 1, characterized in that, when the node receives (101) the service data generated in the specified period of time, the method further comprises: determining the data processing set that corresponds to the respective labels with based on the labels associated with the service data; and storing (104) the service data in the data processing set.
    [0007]
    7. METHOD, according to claim 6, characterized in that obtaining (103), by the node and from the service data, one or more selected portions of service data according to the respective transfer rates comprises: obtaining data that satisfy the respective throughput based on the respective throughput and respective timestamps of the service data from the data processing set that corresponds to the respective labels.
    [0008]
    8. METHOD according to claim 6, characterized by obtaining (103), by the node and from the service data, one or more selected portions of service data according to the respective transfer rates, comprising, for each respective label: in response to determining that an amount of service data stored in the processing data set that corresponds to the respective label is less than the respective throughput, obtain (103) the service data from the processing set of data based on the amount of service data stored in the data processing set.
    [0009]
    9. METHOD according to claim 1, characterized by determining, by the node when a new block is generated, the respective transfer rates for processing data associated with different labels based on a predetermined mapping relationship between the respective labels. and the respective throughput comprises: when the new block is generated, in response to determining that portions of the service data are associated with at least two different processing priorities, determining (102) the throughput corresponding to the labels of different processing priorities, where a sum of the transfer rates that correspond to the different labels is less than or equal to a block's storage capacity.
    [0010]
    10. COMPUTER-READable, non-transient medium, characterized by storing one or more instructions executable by a computer system to perform data operations based on a trusted protocol, comprising: receiving (101), by a node in a network of trust protocol, service data generated in a specified period of time, wherein the service data comprises a plurality of service data portions, wherein each or more of the plurality of service data portions is associated with a label respective used to represent a processing priority of the service data portions; determining, by the node when a new block is generated, respective baud rates for processing data associated with the different labels based on a predetermined mapping relationship between the respective labels and the respective baud rates; obtaining (103), by the node and from the service data, one or more selected portions of service data in accordance with the respective transfer rates; and storing (104) the one or more selected portions of service data in the new block.
    [0011]
    READING MEDIUM, according to claim 10, characterized in that the operations additionally comprise: determining service data processing priorities of different services; determine mapping relationships between different processing priorities and respective labels; determining (102) the respective transfer rates based on different processing priorities; and establishing mapping relationships between respective labels that correspond to different processing priorities and respective transfer rates.
    [0012]
    12. LEGIBLE MEDIUM, according to claim 11, characterized in that the transfer rates of the same service data are different in different periods of time.
    [0013]
    READING MEDIA, according to claim 12, characterized by obtaining (103), by the node and from the service data, to one or more selected portions of associated service data the respective transfer rates comprising, for each label respective: determining an amount of service data portions associated with the respective labels based on the respective throughput and a storage capacity of the block; and obtaining (103) the amount of service data portions associated with the respective label.
    [0014]
    READING MEDIA, according to claim 10, characterized in that obtaining (103), by the node and from the service data, one or more selected portions of service data according to the respective transfer rates, comprises, for each respective label: in response to determining that the service data is not associated with the respective label, obtain (103), based on an idle capacity of the new block, service data that satisfies the idle capacity and is not associated with the respective label; or in response to determining (102) that the respective throughput corresponding to the respective label is zero, obtaining (103), based on the idle capacity of the block, service data that satisfies the idle capacity and is associated with the respective label .
    [0015]
    15. READING MEDIA, according to claim 10, characterized in that, when the node receives (101) the service data generated in the specified period of time, it further comprises: determining the data processing set that corresponds to the respective labels based on on the labels comprised in the service data; and storing (104) the service data in the data processing set.
    [0016]
    16. COMPUTER IMPLEMENTED SYSTEM, characterized by comprising: one or more computers; and one or more computer memory devices interoperablely coupled with one or more computers and having tangible, non-transient, machine-readable media storing one or more instructions which, when executed by the one or more computers, perform one or more operations of data based on a trusted protocol, wherein the operations comprise: receiving (101), by a node on a trusted protocol network, service data generated in a specified period of time, wherein the service data comprises a plurality of service data portions, wherein each or more of the plurality of service data portions is associated with a respective label used to represent a processing priority of the service data portion; determining (102), by the node when a new block is generated, respective baud rates for processing data associated with the different labels based on a predetermined mapping relationship between the respective labels and the respective baud rates; obtaining (103), by the node and from the service data, one or more selected portions of service data in accordance with the respective transfer rates; and storing (104) the one or more selected portions of service data in the new block.
    [0017]
    17. SYSTEM, according to claim 16, characterized in that the operations additionally comprise: determining service data processing priorities of different services; determine mapping relationships between different processing priorities and labels; determining (102) the respective transfer rates based on different processing priorities; and establishing mapping relationships between respective labels that correspond to different processing priorities and respective transfer rates.
    [0018]
    18. SYSTEM, according to claim 17, characterized in that the transfer rates of the same service data are different in different periods of time.
    [0019]
    19. SYSTEM, according to claim 16, characterized in that it obtains (103), by the node and from the service data, one or more selected portions of service data according to the respective transfer rates comprising, for each respective label: determining an amount of service data portions associated with the respective label based on the respective throughput and a storage capacity of the new block; and obtaining (103) the amount of service data portions associated with the respective label.
    [0020]
    20. SYSTEM, according to claim 16, characterized in that obtaining (103), by the node and from the service data, one or more selected portions of service data according to the respective transfer rates, comprises, for each respective label: in response to determining that the service data is not associated with the respective label, obtain (103), based on an idle capacity of the new block, service data that satisfies the idle capacity and that is not associated with the respective label; or in response to determining (102) that the respective throughput corresponding to the label is zero, obtaining (103), based on the idle capacity of the block, service data that satisfies the idle capacity and is associated with the respective label.
    类似技术:
    公开号 | 公开日 | 专利标题
    BR112019013412B1|2022-02-01|Method for processing data based on a reliable protocol, computer-readable medium, and computer-implemented system.
    BR112019020374B1|2022-01-25|Method, non-transient computer-readable storage media and system for blockchain consensus
    BR112019013394A2|2020-03-03|DATA PROCESSING METHOD AND DATA PROCESSING DEVICE
    BR112019013441A2|2019-12-31|data storage method and data storage device
    WO2018214897A1|2018-11-29|Database state determining method and device, and consistency verifying method and device
    BR112019013204A2|2019-12-10|service processing method and service processing device
    BR112019014589A2|2020-02-18|SERVICE AND APPLIANCE PROCESSING METHOD
    TWI695260B|2020-06-01|Block data verification method and device
    TWI671699B|2019-09-11|Method and device for processing transaction request
    TWI694700B|2020-05-21|Data processing method and device, user terminal
    Träff et al.2014|MPI collectives and datatypes for hierarchical all-to-all communication
    BR112019009576A2|2019-10-22|data processing method and device
    US10846245B2|2020-11-24|Minimizing usage of hardware counters in triggered operations for collective communication
    BR112019010368B1|2021-12-14|METHOD FOR PROCESSING A SERVICE REQUEST AND DEVICE FOR PROCESSING A SERVICE REQUEST
    BR112019009591B1|2021-11-23|COMPUTER IMPLEMENTED METHOD FOR PERFORMING DISPLAY SWITCHING IN A TRUST PROTOCOL NETWORK, COMPUTER-READABLE, NON- TRANSIENT, AND COMPUTER IMPLEMENTED SYSTEM
    同族专利:
    公开号 | 公开日
    AU2018246765A1|2019-07-18|
    CN107391527B|2020-03-27|
    EP3547169B1|2022-01-12|
    RU2726384C1|2020-07-13|
    TW201837736A|2018-10-16|
    AU2018246765B2|2020-10-08|
    JP6716149B2|2020-07-01|
    PH12019501537A1|2019-09-09|
    TWI660274B|2019-05-21|
    US20190332430A1|2019-10-31|
    US10545794B2|2020-01-28|
    BR112019013412A2|2020-03-03|
    WO2018177245A1|2018-10-04|
    EP3547169A1|2019-10-02|
    CA3048739A1|2018-10-04|
    KR20190088535A|2019-07-26|
    US10877802B2|2020-12-29|
    ZA201904232B|2020-11-25|
    KR102125177B1|2020-07-08|
    EP3547169A4|2019-11-06|
    MX2019007805A|2019-09-06|
    SG10202100732VA|2021-03-30|
    US20200159577A1|2020-05-21|
    CN107391527A|2017-11-24|
    CA3048739C|2020-07-14|
    JP2020514866A|2020-05-21|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    JP2005031929A|2003-07-11|2005-02-03|Hitachi Ltd|Management server for assigning storage area to server, storage device system, and program|
    US7675897B2|2005-09-06|2010-03-09|Current Technologies, Llc|Power line communications system with differentiated data services|
    RU2296362C1|2005-09-20|2007-03-27|Военная академия связи|Method for servicing varying priority requests from users of computer system|
    CN101098295B|2006-06-27|2010-10-20|大唐移动通信设备有限公司|High speed downlink packet accessing medium access controlled multi-queue transmission method and device|
    EP3484123A1|2007-01-12|2019-05-15|University-Industry Cooperation Group Of Kyung Hee University|Packet format of network abstraction layer unit, and algorithm and apparatus for video encoding and decoding using the format|
    CN101904106A|2007-12-18|2010-12-01|西门子公司|Method for transmitting data records|
    CN101447940B|2008-12-23|2011-03-30|杭州华三通信技术有限公司|Method and device for updating access control list rules|
    JP2014509109A|2011-01-11|2014-04-10|アップルインコーポレイテッド|Real-time or near real-time streaming|
    TWI459223B|2012-08-15|2014-11-01|Hon Hai Prec Ind Co Ltd|System and method for creating indexes of massive data|
    CN105960637B|2013-11-28|2020-09-11|英特尔公司|Block-based indexing techniques|
    US20160112200A1|2014-10-17|2016-04-21|21, Inc.|Cryptographic hashing circuitry having improved scheduling efficiency|
    US10409827B2|2014-10-31|2019-09-10|21, Inc.|Digital currency mining circuitry having shared processing logic|
    US9436923B1|2015-02-26|2016-09-06|Skuchain, Inc.|Tracking unitization occurring in a supply chain|
    EP3278287A4|2015-03-31|2018-08-22|Nasdaq, Inc.|Systems and methods of blockchain transaction recordation|
    US20160342977A1|2015-05-20|2016-11-24|Vennd.io Pty Ltd|Device, method and system for virtual asset transactions|
    AU2016307202A1|2015-05-26|2017-12-07|Tzero Ip, Llc|Obfuscation of intent in transactions using cryptographic techniques|
    KR101701131B1|2016-04-28|2017-02-13|주식회사 라피|Data recording and validation methods and systems using the connecting of blockchain between different type|
    CN106209877A|2016-07-19|2016-12-07|井创（北京）科技有限公司|A kind of be certification core with block chain backstage false-proof authentication system|
    CN106534085B|2016-10-25|2019-09-06|杭州云象网络技术有限公司|A kind of method for secret protection based on block chain technology|
    CN107391526B|2017-03-28|2021-04-02|创新先进技术有限公司|Data processing method and device based on block chain|
    CN107391527B|2017-03-28|2020-03-27|创新先进技术有限公司|Data processing method and device based on block chain|CN107391527B|2017-03-28|2020-03-27|创新先进技术有限公司|Data processing method and device based on block chain|
    CN107450979B|2017-03-28|2020-06-02|创新先进技术有限公司|Block chain consensus method and device|
    CN107992356B|2017-12-13|2021-09-14|深圳壹账通智能科技有限公司|Block chain transaction block processing method, electronic device and readable storage medium|
    CN108401026B|2018-02-26|2020-06-19|深圳智乾区块链科技有限公司|Block chain-based data storage method, system and computer-readable storage medium|
    CN108696522A|2018-05-11|2018-10-23|北京奇虎科技有限公司|Task processing method, calculate node, block catenary system in a kind of block chain|
    US20190356471A1|2018-05-17|2019-11-21|International Business Machines Corporation|Ad-hoc smart contract generation in a blockchain|
    CN109088952A|2018-10-30|2018-12-25|深圳瑞生耀电子有限公司|Embedded device is linked into the device and method of block chain|
    CN109617964B|2018-12-12|2021-11-09|成都四方伟业软件股份有限公司|Big data storage method and device based on block chain|
    CN112181474A|2019-07-04|2021-01-05|北京新唐思创教育科技有限公司|Block chain service processing method, electronic device and computer storage medium|
    CN111209336B|2019-12-30|2020-09-15|广州博士信息技术研究院有限公司|Data distribution method and device based on block chain and server|
    CN112364010B|2021-01-12|2021-04-23|支付宝信息技术有限公司|Method and device for verifying existence of important business record|
    法律状态:
    2021-04-06| B25A| Requested transfer of rights approved|Owner name: ADVANTAGEOUS NEW TECHNOLOGIES CO., LTD. (KY) |
    2021-04-27| B25A| Requested transfer of rights approved|Owner name: ADVANCED NEW TECHNOLOGIES CO., LTD. (KY) |
    2021-10-13| B350| Update of information on the portal [chapter 15.35 patent gazette]|
    2021-12-21| B09A| Decision: intention to grant [chapter 9.1 patent gazette]|
    2022-02-01| B16A| Patent or certificate of addition of invention granted [chapter 16.1 patent gazette]|Free format text: PRAZO DE VALIDADE: 20 (VINTE) ANOS CONTADOS A PARTIR DE 26/03/2018, OBSERVADAS AS CONDICOES LEGAIS. |
    优先权:
    申请号 | 申请日 | 专利标题
    CN201710191658.9|2017-03-28|
    CN201710191658.9A|CN107391527B|2017-03-28|2017-03-28|Data processing method and device based on block chain|
    PCT/CN2018/080482|WO2018177245A1|2017-03-28|2018-03-26|Block chain-based data processing method and equipment|
    [返回顶部]